space partitioning tree

space partitioning tree
дерево распределения пространства

English-Russian dictionary of terms that are used in computer games. 2014.

Поможем сделать НИР

Смотреть что такое "space partitioning tree" в других словарях:

  • Space partitioning — In mathematics, space partitioning is the process of dividing a space (usually a Euclidean space) into two or more disjoint subsets (see also partition of a set). In other words, space partitioning divides a space into non overlapping regions.… …   Wikipedia

  • Binary space partitioning — (BSP) is a method for recursively subdividing a space into convex sets by hyperplanes. This subdivision gives rise to a representation of the scene by means of a tree data structure known as a BSP tree.In simpler words, it is a method of breaking …   Wikipedia

  • Binary Space Partitioning — Der Begriff Binary Space Partitioning (BSP, „binäre Raumpartitionierung“) bezeichnet eine Technik zur Partitionierung multidimensionaler Daten durch eine Menge von Hyperebenen. Die so erstellte Datenstruktur ist ein Binärbaum und wird BSP Baum… …   Deutsch Wikipedia

  • Binary Space Partitioning — Partition binaire de l espace Pour les articles homonymes, voir BSP. La partition binaire de l espace (binary space partitioning ou BSP) est un système utilisé par un moteur de jeu pour calculer des espaces pleins (bloquant) et vides (ou le… …   Wikipédia en Français

  • Binary space partitioning — Partition binaire de l espace Pour les articles homonymes, voir BSP. La partition binaire de l espace (binary space partitioning ou BSP) est un système utilisé par un moteur de jeu pour calculer des espaces pleins (bloquant) et vides (ou le… …   Wikipédia en Français

  • Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… …   Wikipedia

  • Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… …   Wikipedia

  • Cover tree — The cover tree is a type of data structure in computer science that is specifically designed to facilitate the speed up of a nearest neighbor search. It is a refinement of the Navigating Net data structure, and related to a variety of other data… …   Wikipedia

  • Radix tree — In computer science, a radix tree (also patricia trie or radix trie) is a space optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. Unlike… …   Wikipedia

  • Metric tree — This article is about the data structure. For the type of metric space, see Real tree. A metric tree is any tree data structure specialized to index data in metric spaces. Metric trees exploit properties of metric spaces such as the triangle… …   Wikipedia

  • Hash tree — A binary hash tree In cryptography and computer science Hash trees or Merkle trees are a type of data structure[citation needed] which contains a tree of summary information about a larger piece of da …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»